Density of Smooth Boolean Functions
نویسنده
چکیده
The Sauer-Shelah lemma has been instrumental in the analysis of algorithms in many areas including learning theory, combinatorial geometry, graph theory. Algorithms over discrete structures, for instance, sets of Boolean functions, often involve a search over a constrained subset which satisfies some properties. In this paper we study the complexity of classes of functions h of finite VCdimension which satisfy a local ‘smoothness’ property expressed as having long repeated values around elements of a given sample. A tight upper bound is obtained on the density of such classes. It is shown to possess a sharp threshold with respect to the smoothness parameter.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملBoolean representation of manifolds and functions
It is shown that a smooth n–dimensional manifold in Rn with a boundary admits a Boolean representation in terms of closed half spaces defined by the tangent hyperplanes at the points on its boundary. A similar result is established for smooth functions on closed convex domains in Rn. The latter result is considered as a form of the Legendre transform.
متن کاملThe Fourier Entropy-Influence conjecture holds for a log-density 1 class of cryptographic Boolean functions
We consider the Fourier Entropy-Influence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI conjecture is true for the functions satisfying the strict avalanche criterion, which forms a subset of asymptotic log–density 1 in the set of all Boolean functions. Further, we prove that the FEI conjecture is satisfied for plateaued Boolean functions, monomial alg...
متن کاملNew Upper Bounds on the Average PTF Density of Boolean Functions
A Boolean function f : {1,−1}n → {1,−1} is said to be sign-represented by a real polynomial p : Rn → R if sgn(p(x)) = f(x) for all x ∈ {1,−1}n. The PTF density of f is the minimum number of monomials in a polynomial that sign-represents f . It is well known that every n-variable Boolean function has PTF density at most 2n. However, in general, less monomials are enough. In this paper, we presen...
متن کاملOn the Computational Power of Sigmoid versus Boolean Threshold Circuits
We examine the power of constant depth circuits with sigmoid (i.e. smooth) threshold gates for computing boolean functions. It is shown that, for depth 2, constant size circuits of this type are strictly more powerful than constant size boolean threshold circuits (i.e. circuits with boolean threshold gates). On the other hand it turns out that, for any constant depth d , polynomial size sigmoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007